Integrity of Regular Graphs and Integrity Graphs
نویسندگان
چکیده
The integrity of a graph G, I(G), is defined by I(G) = minS⊆V (G){|S| + m(G − S)} where m(G− S) is the maximum order of the components of G− S. In general the integrity of r-regular graph is not known [?]. We answer the following question for special regular graphs. For any given two integers p and r such that pr 2 is an integer, is there a r-regular graph, say G ∗, on p vertices having size q = pr 2 such that I(G(p, pr 2 )) ≤ I(G∗)
منابع مشابه
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملIntegrity of Fuzzy Graphs
In this paper, integrity of fuzzy graph is defined. Integrity of special types of graphs with constant node strength and node strength sequences as (pn−1 1 , p2) is discussed. Also, integrity of regular fuzzy graph and complete fuzzy graph is presented.
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کامل